Eigenvalues of Symmetrical Matrices and Graphs
نویسندگان
چکیده
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملEigenvalues and Pseudo-eigenvalues of Toeplitz Matrices
The eigenvalues of a nonhermitian Toeplitz matrix A are usually highly sensitive to perturbations, having condition numbers that increase exponentially with the dimension N. An equivalent statement is that the resolvent ( ZZ A)’ of a Toeplitz matrix may be much larger in norm than the eigenvalues alone would suggest-exponentially large as a function of N, even when z is far from the spectrum. B...
متن کاملLow Eigenvalues of Laplacian Matrices of Large Random Graphs
Abstract For each n ≥ 2, let An = (ξij) be an n × n symmetric matrix with diagonal entries equal to zero and the entries in the upper triangular part being independent with mean μn and standard deviation σn. The Laplacian matrix is defined by ∆n = diag( ∑n j=1 ξij)1≤i≤n − An. In this paper, we obtain the laws of large numbers for λn−k(∆n), the (k+ 1)-th smallest eigenvalue of ∆n, through the st...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملOn the eigenvalues of non-commuting graphs
The non-commuting graph $Gamma(G)$ of a non-abelian group $G$ with the center $Z(G)$ is a graph with thevertex set $V(Gamma(G))=Gsetminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent in $Gamma(G)$if and only if $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1994
ISSN: 0021-8693
DOI: 10.1006/jabr.1994.1244